Testing Incentive Compatibility in Display Ad Auctions
نویسندگان
چکیده
Consider a buyer participating in a repeated auction, such as those prevalent in display advertising. How would she test whether the auction is incentive compatible? To bid effectively, she is interested in whether the auction is single-shot incentive compatible—a pure second-price auction, with fixed reserve price—and also dynamically incentive compatible—her bids are not used to set future reserve prices. In this work we develop tests based on simple bid perturbations that a buyer can use to answer these questions, with a focus on dynamic incentive compatibility. There are many potential A/B testing setups that one could use, but we find that many natural experimental designs are, in fact, flawed. For example, we show that additive perturbations can lead to paradoxical results, where higher bids lead to lower optimal reserve prices. We precisely characterize this phenomenon and show that reserve prices are only guaranteed to be monotone for distributions satisfying the Monotone Hazard Rate (MHR) property. The experimenter must also decide how to split traffic to apply systematic perturbations. It is tempting to have this split be randomized, however, we demonstrate empirically that unless the perturbations are aligned with the partitions used by the seller to compute reserve prices, the results are guaranteed to be inconclusive. We validate our results with experiments on real display auction data and show that a buyer can quantify both single-shot and dynamic incentive compatibility even under realistic conditions where only the cost of the impression is observed (as opposed to the exact reserve price). We analyze the cost of running such experiments, exposing trade-offs between test accuracy, cost, and underlying market dynamics. ACM Reference Format: Sebastien Lahaie, AndrésMuñozMedina, Balasubramanian Sivan, and Sergei Vassilvitskii. 2017. Testing Incentive Compatibility in Display Ad Auctions. In Proceedings of ACM Conference (Conference’17). ACM, New York, NY, USA, 10 pages. https://doi.org/10.1145/nnnnnnn.nnnnnnn Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. Conference’17, July 2017, Washington, DC, USA © 2017 Association for Computing Machinery. ACM ISBN 978-x-xxxx-xxxx-x/YY/MM. . . $15.00 https://doi.org/10.1145/nnnnnnn.nnnnnnn
منابع مشابه
Incentive Compatibility in Multi-unit Auctions
We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allocation mechanism is incentive compatible if and only if it is nondecreasing in marginal utilities (NDMU). The notion of incentive compatibility we adopt is dominant strategy in private value models and ex post incentive compatibility in models with interdependent values. NDMU is the following req...
متن کاملPricing combinatorial auctions
Single-item auctions have many desirable properties. Mechanisms exist to ensure optimality, incentive compatibility and market-clearing prices. When multiple items are offered through individual auctions, a bidder wanting a bundle of items faces an exposure problem if the bidder places a high value on a combination of goods but a low value on strict subsets of the desired collection. To remedy ...
متن کاملA Theory of Collusion in Multiple Object Simultaneous Auctions
The choice of strategies by bidders who are allowed to communicate in auctions is studied. Using the tools of mechanism design, the possible outcomes of communication between bidders participating in a series of simultaneous first-price auctions are investigated. A variety of mechanisms are incentive compatible when side payments are not allowed. When attention is restricted to mechanisms that ...
متن کاملIncentive Compatibility on Multiple Internet Auctions based on Bidding Support Agents
Agent-mediated electronic commerce has recently commanded much attention. We envision a future in which many people trade their goods by using a bidding support agent on Internet auctions. In this paper, we formalize a situation in which people are trading their goods on Internet auctions and employing bidding support agents. Then, we prove that in the above situation all participants need to s...
متن کاملExpressiveness and Optimization under Incentive Compatibility Constraints in Dynamic Auctions
This thesis designs and analyzes auctions for persistent goods in three domains with arriving and departing bidders, quantifying tradeoffs between design objectives. The central objective is incentive compatibility, ensuring that it is in bidders’ best interest to reveal their private information truthfully. Other primary concerns are expressiveness, i.e. the richness of the effective bidding l...
متن کامل